< -package:ghc-lib-parser package:linear-base

(<) :: Ord a => a % 1 -> a % 1 -> Bool
linear-base Data.Ord.Linear
(<$) :: (Functor f, Consumable b) => a % 1 -> f b % 1 -> f a
linear-base Control.Functor.Linear
Linearly typed replacement for the standard (<$) function.
(<$>) :: Functor f => (a % 1 -> b) % 1 -> f a % 1 -> f b
linear-base Control.Functor.Linear
(<&>) :: Functor f => f a % 1 -> (a % 1 -> b) % 1 -> f b
linear-base Control.Functor.Linear
(<&>) = flip fmap
(<*>) :: Applicative f => f (a % 1 -> b) % 1 -> f a % 1 -> f b
linear-base Control.Functor.Linear
Apply the linear function in a control applicative functor to the value of type a in another functor. This is essentialy composing two effectful computations, one that produces a function f :: a %1-> b and one that produces a value of type a into a single effectful computation that produces a value of type b.
(<$) :: (Functor f, Consumable b) => a -> f b % 1 -> f a
linear-base Data.Functor.Linear
Replace all occurances of b with the given a and consume the functor f b.
(<$>) :: Functor f => (a % 1 -> b) -> f a % 1 -> f b
linear-base Data.Functor.Linear
(<*>) :: Applicative f => f (a % 1 -> b) % 1 -> f a % 1 -> f b
linear-base Data.Functor.Linear
(<>) :: Semigroup a => a % 1 -> a % 1 -> a
linear-base Data.Monoid.Linear
(<=) :: Ord a => a % 1 -> a % 1 -> Bool
linear-base Data.Ord.Linear
(<*>) :: Replicator (a % 1 -> b) % 1 -> Replicator a % 1 -> Replicator b
linear-base Data.Replicator.Linear
(<*>) :: V n (a % 1 -> b) % 1 -> V n a % 1 -> V n b
linear-base Data.V.Linear
(<*) :: (Applicative f, Consumable b) => f a % 1 -> f b % 1 -> f a
linear-base Prelude.Linear
Linearly typed replacement for the standard (<*) function.